Approximate predictability of Pseudo-Metric Systems
نویسندگان
چکیده
منابع مشابه
INTUITIONISTIC FUZZY QUASI-METRIC AND PSEUDO-METRIC SPACES
In this paper, we propose a new definition of intuitionistic fuzzyquasi-metric and pseudo-metric spaces based on intuitionistic fuzzy points. Weprove some properties of intuitionistic fuzzy quasi- metric and pseudo-metricspaces, and show that every intuitionistic fuzzy pseudo-metric space is intuitionisticfuzzy regular and intuitionistic fuzzy completely normal and henceintuitionistic fuzzy nor...
متن کاملApproximate equivalence and synchronization of metric transition systems
In this paper, we consider metric transition systems which are transition systems equipped with metrics for observation and synchronization labels. The existence of metrics leads to the introduction of two new concepts, (i) ( , δ)-approximate (bi)simulation of transition systems and (ii) approximate synchronization of transition systems. We show that the notion of ( , δ)-approximate (bi)simulat...
متن کاملintuitionistic fuzzy quasi-metric and pseudo-metric spaces
in this paper, we propose a new definition of intuitionistic fuzzyquasi-metric and pseudo-metric spaces based on intuitionistic fuzzy points. weprove some properties of intuitionistic fuzzy quasi- metric and pseudo-metricspaces, and show that every intuitionistic fuzzy pseudo-metric space is intuitionisticfuzzy regular and intuitionistic fuzzy completely normal and henceintuitionistic fuzzy nor...
متن کاملUnsupervised distance metric learning using predictability
Distance-based learning methods, like clustering and SVMs, are dependent on good distance metrics. This paper does unsupervised metric learning in the context of clustering. We seek transformations of data which give clean and well separated clusters where clean clusters are those for which membership can be accurately predicted. The transformation (hence distance metric) is obtained by minimiz...
متن کاملApproximate Clustering via Metric Partitioning
We consider the following metric clustering problem. We are given two point sets X (clients) and Y (servers), and a metric on Z = X ∪ Y . We would like to cover the clients by balls centered at the servers. The objective function to minimize is the sum of the α-th power of the radii of the balls. Here α ≥ 1 is a parameter of the problem (but not of a problem instance). For any ε > 0, we describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Analysis: Hybrid Systems
سال: 2020
ISSN: 1751-570X
DOI: 10.1016/j.nahs.2020.100869